package problema029;

import java.math.BigInteger;
import java.util.HashSet;
import java.util.Set;

public class distinctSum {
	
	public static void main(String[] args){
		System.out.println(distinctPowers());
	}
	
	public static int distinctPowers(){
		Set<BigInteger> numeros = new HashSet<BigInteger>();
		BigInteger act;
		for(Integer i = 2; i <= 100; i++){
			for(int j = 2; j <= 100; j++){
				act = new BigInteger(i.toString());
				act = act.pow(j);
				numeros.add(act);
			}
		}		
		return numeros.size();
	}
	
	
	
}
